An upper bound of a generalized upper Hamiltonian number of a graph

In this article we study graphs with ordering of vertices, define a generalization called pseudoordering, and for graph $H$ the $H$-Hamiltonian number $G$. We will show that concept is both Hamiltonian traceable number. prove equivalent characteristics an isomorphism $G$ using Furthermore, fixed each path has maximal upper number, which same claim numbers numbers. Finally every connected only paths have